Genetic multi-criteria approach to flexible line scheduling
نویسندگان
چکیده
منابع مشابه
Solving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملMulti-Criteria Scheduling Optimization With Genetic Algorithms
Multi-criteria scheduling optimization with genetic algorithms is described. Scheduling optimization methodology provides the planner with a quick and efficient scheduling method and enables him/her to experiment and decide which of the suitable solutions will become the production plan. The scheduling system is composed of a business information system a database, a discrete event simulation m...
متن کاملA genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes
Genetic algorithms (GAs) have been used widely for such combinatorial optimization problems as the traveling salesman problem (TSP), the quadratic assignment problem (QAP), and job shop scheduling. In all of these problems there is usually a well defined representation which GA's use to solve the problem. We present a novel approach for solving two related problems-lot sizing and sequencing-con...
متن کاملA new approach for multi-criteria scheduling
In this paper we propose a new approach, recommended for solving certain class of multi-criteria scheduling problems, with the use of cloud exploration of the solution space supported by finegrained parallel computing. The approach allow us to approximate Pareto front more accurately than other known algorithms in competitive time. To show and check advantageous properties of the proposed appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 1998
ISSN: 0888-613X
DOI: 10.1016/s0888-613x(98)00014-0